An Introduction to Hierarchical (H-) Rank and TT-Rank of Tensors with Examples
نویسندگان
چکیده
We review two similar concepts of hierarchical rank of tensors (which extend the matrix rank to higher order tensors): the TT-rank and the H-rank (hierarchical or H-Tucker rank). Based on this notion of rank, one can define a data-sparse representation of tensors involving O(dnk + dk 3) data for order d tensors with mode sizes n and rank k. Simple examples underline the differences and similarities between the different formats and ranks. Finally, we derive rank bounds for tensors in one of the formats based on the ranks in the other format.
منابع مشابه
Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch & Lubich, 2007 and 2010) to the recently proposed Hierarchical Tucker tensor format (HT, Hackbusch & Kühn, 2009) and the Tensor Train format (TT, Oseledets, 2011), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamic...
متن کاملDynamical approximation of hierarchical Tucker and tensor-train tensors
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch & Lubich, 2007 and 2010) to the recently proposed Hierarchical Tucker tensor format (HT, Hackbusch & Kühn, 2009) and the Tensor Train format (TT, Oseledets, 2011), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamic...
متن کاملEfficient tensor completion: Low-rank tensor train
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global information of tensors thanks to its construction by a wellbalanced matricization scheme. Two algorithms are proposed to solve the corresponding tensor completion p...
متن کامل" Differential geometry for tensors with fixed hierarchical
Recently, a number of authors have presented several geometries for rankstructured matrix and tensor spaces, namely the set of matrices or tensors with fixed matrix, Tucker or TT rank. In this talk we present a unifying approach for establishing a smooth, differential structure on the set of tensors with fixed hierarchical Tucker rank. Our approach describes this set as a smooth submanifold, gl...
متن کاملBlack Box Approximation of Tensors in Hierarchical Tucker Format
We derive and analyse a scheme for the approximation of order d tensors A ∈ R n×···×n in the hierarchical (H-) Tucker format, a dimension-multilevel variant of the Tucker format and strongly related to the TT format. For a fixed rank parameter k, the storage complexity of a tensor in H-Tucker format is O(dk 3 + dnk) and we present a (heuristic) algorithm that finds an approximation to a tensor ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Meth. in Appl. Math.
دوره 11 شماره
صفحات -
تاریخ انتشار 2011